Extraction certifiée dans Coq-en-Coq
نویسنده
چکیده
The Coq proof assistant allows generation of programs correct by construction. This feature—called extraction—can be used to build certified libraries. In this article, we present a formalization of the extraction in Coq, along with some properties that have been formally proved. This work is in line with B. Barras’s work on formalizing Coq in Coq. MOTS-CLÉS : assistant de preuve, calcul des constructions inductives, certification, Coq, extraction, programmation fonctionnelle
منابع مشابه
Programmation fonctionnelle certifiée : L'extraction de programmes dans l'assistant Coq. (Certified functional programming : Program extraction within Coq proof assistant)
This work concerns the generation of programs which are certified to be correct byconstruction. These programs are obtained by extracting relevant information from construc-tive proofs made with the Coq proof assistant.Such a translation, named “extraction”, of constructive proofs into functional programsis not new, and corresponds to an isomorphism known as Curry-Howard’s. ...
متن کاملA Certified Multi-prover Verification Condition Generator
Deduction-based software verification tools have reached a maturity allowing them to be used in industrial context where a very high level of assurance is required. This raises the question of the level of confidence we can grant to the tools themselves. We present a certified implementation of a verification condition generator. An originality is its genericity with respect to the logical cont...
متن کاملFormalising Sylow's theorems in Coq
This report presents a formalisation of Sylow’s theorems done in Coq. The formalisation has been done in a couple of weeks on top of Georges Gonthier’s ssreflect [2]. There were two ideas behind formalising Sylow’s theorems. The first one was to get familiar with Georges way of doing proofs. The second one was to contribute to the collective effort to formalise a large subset of group theory in...
متن کاملUp to Context Proofs for the -calculus in the Coq System up to Context Proofs for the -calculus in the Coq System
RRsumm La formalisation dans le systtme Coq de la thhorie des progressions de relations de Sangiorgi permet, dans son application au-calcul, la vriication du thhorrme de preuve au contexte prrs. Ce rrsultat s'avre crucial dans le cadre d'une mmcanisation du-calcul, dans la mesure oo il facilite considdrablement les preuves de bisimulation, en les rendant plus compactes et plus lisibles. S'agiss...
متن کاملDeveloping Certiied Programs in the System Coq the Program Tactic Developing Certiied Programs in the System Coq the Program Tactic
The system Coq is an environment for proof development based on the Calculus of Constructions extended by inductive deenitions. Functional programs can be extracted from constructive proofs written in Coq. The extracted program and its corresponding proof are strongly related. The idea in this paper is to use this link to have another approach: to give a program and to generate automatically th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009